Relational properties of sequential composition of coalgebras
نویسندگان
چکیده
In this paper we define a sequential composition for arbitrary co-algebras in a Dedekind category. We show some basic algebraic properties of this operation up to bisimulation. Furthermore, we consider certain recursive equations and provide an explicit solution, i.e., a solution not based on an iterative process.
منابع مشابه
On descent for coalgebras and type transformations
We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...
متن کاملA NEW APPROACH TO STABILITY ANALYSIS OF FUZZY RELATIONAL MODEL OF DYNAMIC SYSTEMS
This paper investigates the stability analysis of fuzzy relational dynamic systems. A new approach is introduced and a set of sufficient conditions is derived which sustains the unique globally asymptotically stable equilibrium point in a first-order fuzzy relational dynamic system with sumproduct fuzzy composition. This approach is also investigated for other types of fuzzy relational composit...
متن کاملLinear optimization on Hamacher-fuzzy relational inequalities
In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Hamacher family of t-norms is considered as fuzzy composition. Hamacher family of t-norms is a parametric family of continuous strict t-norms, whose members are decreasing functions of ...
متن کاملMax-Min averaging operator: fuzzy inequality systems and resolution
Minimum and maximum operators are two well-known t-norm and s-norm used frequently in fuzzy systems. In this paper, two different types of fuzzy inequalities are simultaneously studied where the convex combination of minimum and maximum operators is applied as the fuzzy relational composition. Some basic properties and theoretical aspects of the problem are derived and four necessary and suffi...
متن کاملA Relational Encoding for a Clash-Free Subset of ASMs
This paper defines a static check for clash-freedom of ASM rules, including sequential and parallel composition, nondeterministic choice, and recursion. The check computes a formula that, if provable, makes a relational encoding of ASM rules possible, which is an important prerequisite for efficient deduction. The check is general enough to cover all sequential rules as well as many typical use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Algebr. Meth. Program.
دوره 83 شماره
صفحات -
تاریخ انتشار 2014